The robust spanning tree problem with interval data
نویسندگان
چکیده
منابع مشابه
The robust spanning tree problem with interval data
Motivated by telecommunications applications we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de5ne the robust spanning tree problem to hedge against the worst case contingency, and present a mixed integer programming formulation of the problem. We also de5ne some useful optimalit...
متن کاملOn the complexity of the robust spanning tree problem with interval data
This paper studies the complexity of the robust spanning tree problem with interval data (RSTID). It shows that the problem is NP-complete, settling the conjecture of Kouvelis and Yu, and that it remains so for complete graphs or when the intervals are all [0; 1]. These results indicate that the di8culty of RSTID stems from both the graph topology and the structure of the cost intervals, sugges...
متن کاملA Constraint Satisfaction Approach to the Robust Spanning Tree Problem with Interval Data
Robust optimization is one of the fundamen tal approaches to deal with uncertainty in combinatorial optimization. This paper con siders the robust spanning tree problem with interval data, which arises in a variety of telecommunication applications. It proposes a constraint satisfaction approach using a combinatorial lower bound, a pruning com ponent that removes infeasible and subopti mal ...
متن کاملA branch and bound algorithm for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem edge costs lie in an interval instead of having a fixed value. Interval numbers model uncertainty about the exact cost values. A robust spanning tree is a spanning tree whose total cost minimizes the maximum deviation fr...
متن کاملA Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem edge costs lie in an interval instead of having a fixed value. Interval numbers model uncertainty about the exact cost values. A robust spanning tree is a spanning tree whose total cost minimizes the maximum deviation fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2001
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(01)00078-5